A Language for Modular Answer Set Programming: Application to ACC Tournament Scheduling
نویسندگان
چکیده
In this paper we develop a declarative language for modular answer set programming (ASP). Our language allows to declaratively state how one ASP module can import processed answer sets from another ASP module. We define the syntax and semantics of our language and illustrate its applicability by modeling the ACC tournament scheduling problem. Besides the elegance of developing declarative programs in a modular manner, our illustration shows that a problem that is not timely solvable when done in a monolithic way, but becomes solvable when done in a modular way.
منابع مشابه
Solving Modular Model Expansion: Case Studies
Model expansion task is the task representing the essence of search problems where we are given an instance of a problem and are searching for a solution satisfying certain properties. Such tasks are common in AI planning, scheduling, logistics, supply chain management, etc., and are inherently modular. Recently, the model expansion framework was extended to deal with multiple modules to repres...
متن کاملScheduling a Major College Basketball Conference - Revisited
Nemhauser and Trick presented the problem of nding a timetable for the 1997/98 Atlantic Coast Conference (ACC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC. Finite-domain constraint programmingis another programming technique that can be used for solving combinatorial search problems such as sports tournament ...
متن کاملIndustrial-Size Scheduling with ASP+CP
Answer Set Programming (ASP) combines a powerful, theoretically principled knowledge representation formalism and powerful solvers. To improve efficiency of computation on certain classes of problems, researchers have recently developed hybrid languages and solvers, combining ASP with language constructs and solving techniques from Constraint Programming (CP). The resulting ASP+CP solvers exhib...
متن کاملA multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
متن کاملPlanning and Scheduling in Hybrid Domains Using Answer Set Programming
In this paper we present an Action Language-Answer Set Programming based approach to solving planning and scheduling problems in hybrid domains domains that exhibit both discrete and continuous behavior. We use action language H to represent the domain and then translate the resulting theory into an A-Prolog program. In this way, we reduce the problem of finding solutions to planning and schedu...
متن کامل